550B - Preparing Olympiad - CodeForces Solution

bitmasks brute force *1400

Please click on ads to support us..

Python Code: 

import itertools

n, l, r, x = map(int, input().split())
difficulties = [int(i) for i in input().split()]
difficulties.sort()

subSets = []
for i in range(2, n + 1):
    subSets.extend(list(itertools.combinations(difficulties, i)))

count = 0
for subSet in subSets:
    if subSet[-1] - subSet[0] < x:
        continue
    if sum(subSet) < l:
        continue
    if sum(subSet) > r:
        continue
    count += 1

print(count)

C++ Code: 

#include <bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define MP make_pair

// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


int32_t main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n,l,r,x;
	cin >> n >> l >> r >> x;

	vector<int> c(n);
	for (int i = 0; i < n; i++) {
		cin >> c[i];
	}

	int res = 0;
	for (int b = 0; b < (1<<n); b++) {
		vector<int> subset;
		for (int i = 0; i < n; i++) {
			if (b&(1<<i)) subset.PB(c[i]);
		}

		// check if subset verifies conditions
		bool atLeastTwo = (subset.size() >= 2);
		sort(subset.begin(),subset.end());
		bool diffDif = (atLeastTwo && subset[subset.size()-1] - subset[0] >= x);
		bool totalDif;
		int sum = 0;
		for (int i = 0; i < (int)subset.size(); i++) {
			sum += subset[i];
		}
		totalDif = (l <= sum && sum <= r);

		if (atLeastTwo && diffDif && totalDif) res++;
	}
	cout << res << '\n';
}


Comments

Submit
0 Comments
More Questions

1832. Check if the Sentence Is Pangram
1678. Goal Parser Interpretation
1389. Create Target Array in the Given Order
1313. Decompress Run-Length Encoded List
1281. Subtract the Product and Sum of Digits of an Integer
1342. Number of Steps to Reduce a Number to Zero
1528. Shuffle String
1365. How Many Numbers Are Smaller Than the Current Number
771. Jewels and Stones
1512. Number of Good Pairs
672. Richest Customer Wealth
1470. Shuffle the Array
1431. Kids With the Greatest Number of Candies
1480. Running Sum of 1d Array
682. Baseball Game
496. Next Greater Element I
232. Implement Queue using Stacks
844. Backspace String Compare
20. Valid Parentheses
746. Min Cost Climbing Stairs
392. Is Subsequence
70. Climbing Stairs
53. Maximum Subarray
1527A. And Then There Were K
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
318. Maximum Product of Word Lengths
448. Find All Numbers Disappeared in an Array
1155. Number of Dice Rolls With Target Sum
415. Add Strings
22. Generate Parentheses